Possibility Based Modal Semantics for Graded Modifiers

نویسنده

  • Jorma K. Mattila
چکیده

A brief introduction to basic modifiers is given. Any modifier with its dual and the corresponding negation form a DeMorgan triple similar to that of t-norms, t-conorms, and negation. The lattice structure of the unit interval with the usual partial order is similar to that of the set of all membership functions. This structure has a certain connection to implication, by means of the subsethood of fuzzy sets, and it is possible to create a similar expression for modifiers as the axiom of reflexivity is in modal logic. Also, other connections to modal logics can be found. This motivates to develop a formal semantics to modifier logic by means of that of modal logic. Actually, this kind of logic is so-called metalogic concerning either true or false statements about properties of modifiers. This version is based on graded possibility operations. Hence, semantic tools for weakening modifiers are derived. The corresponding things for substantiating modifiers are constructed by means of duality. Finally, some outlines for modifier systems are considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypothesis Generation in Linear Temporal Logic for Clauses in a Restricted Syntactic Form

Possibility theory and modal logic are two knowledge representation frameworks that share some common features, such as the duality between possibility and necessity, as well as some obvious di↵erences since possibility theory is graded but is not primarily a logical setting. In the last thirty years there have been a series of attempts, reviewed in this paper, for bridging the two frameworks i...

متن کامل

Exploring Extensions of Possibilistic Logic over Gödel Logic

In this paper we present completeness results of several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. In a first attempt, based on different characterizations of necessity measures on fuzzy sets, a group of logics, with Kripke style semantics, are built over a restricted language, indeed a two level language compose...

متن کامل

A Logic for Reasoning about Justified Uncertain Beliefs

Justification logic originated from the study of the logic of proofs. However, in a more general setting, it may be regarded as a kind of explicit epistemic logic. In such logic, the reasons why a fact is believed are explicitly represented as justification terms. Traditionally, the modeling of uncertain beliefs is crucially important for epistemic reasoning. While graded modal logics interpret...

متن کامل

Goldblatt-Thomason Theorem for Coalgebraic Graded Modal Logic

Graded modal logic (GML) was originally presented by Kit Fine (1972) to make the modal analogue to counting quantifiers explicit. A graded modal formula ♦k is true at a state w in a Kripke model if there are at least k successor states of w where φ is true. One open problem in GML is to show a Goldblatt-Thomason theorem for it. See M. De Rijke’s notes (2000). Recently, Katsuhiko Sano and Minghu...

متن کامل

Goldblatt-Thomason-style Theorems for Graded Modal Language

We prove two main Goldblatt-Thomason-style Theorems for graded modal language in Kripke semantics: full Goldblatt-Thomason Theorem for elementary classes and relative Goldblatt-Thomason Theorem within the class of finite transitive frames. Two different semantic views on GML allow us to prove these results: neighborhood semantics and graph semantics. By neighborhood semantic view, we can define...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007